A20 - LCS
https://atcoder.jp/contests/tessoku-book/tasks/tessoku_book_t
提出
code: python
s = input()
t = input()
# dpij :=
解答
code: python
s = input()
t = input()
dp = [0 * (len(t) + 1) for i in range(len(s) + 1)]
for i in range(len(s)):
for j in range(len(t)):
if si == tj:
dpi+1j+1 = max(dpij+1, dpi+1j, dpij+1)
else:
dpi+1j+1 = max(dpij+1, dpi+1j)
print(dplen(s)len(t))